Analytic functions in tubes which are representable by Fourier-Laplace integrals
نویسندگان
چکیده
منابع مشابه
On Functions Which Are Fourier Transforms
1. Let G be a locally compact and abelian group, Gl the dual group. Through this paper, "Ml will denote the set of all bounded Radon measure n on G; this set will be considered as a Banach algebra when provided with the customary norm as the dual of the space Co(G) defined below and with the ring product defined as convolution. If /iGM1, its Fourier transform is by definition the bounded and co...
متن کاملWhich Countries are Catching up? New Evidences Using Flexible Fourier Stationary Test
In this paper, we tested the catching-up hypothesis toward the USA using Becker et al. (2006) flexible Fourier KPSS stationary test over the period 1960-2009. The mentioned test could control for unknown number and form of structural breaks using a selected frequency component of a Fourier function. Our results show almost poor countries stay poor and almost rich countries stay rich. South Kore...
متن کاملA Note on Fourier-laplace Transform and Analytic Wave Front Set in Theory of Tempered Ultrahyperfunctions
In this paper we study the Fourier-Laplace transform of tempered ultrahyperfunctions introduced by Sebastião e Silva and Hasumi. We establish a generalization of Paley-Wiener-Schwartz theorem for this setting. This theorem is interesting in connection with the microlocal analysis. For this reason, the paper also contains a description of the singularity structure of tempered ultrahyperfunctions...
متن کاملRapidly Growing Fourier Integrals
1. THE RIEMANN–LEBESGUE LEMMA. In its usual form, the Riemann– Lebesgue Lemma reads as follows: If f ∈ L1 and f̂ (s) = ∫∞ −∞ eisx f (x) dx is its Fourier transform, then f̂ (s) exists and is finite for each s ∈ R and f̂ (s) → 0 as |s| → ∞ (s ∈ R). This result encompasses Fourier sine and cosine transforms as well as Fourier series coefficients for functions periodic on finite intervals. When the i...
متن کاملClustering by analytic functions
Data clustering is a combinatorial optimization problem. This article shows that clustering is also an optimization problem for an analytic function. The mean squared error, or in this case, the squared error can expressed as an analytic function. With an analytic function we benefit from the existence of standard optimization methods: the gradient of this function is calculated and the descent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1980
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1980.90.51